Weakly Secret Bit Commitment: Applications to Lotteries and Fair Exchange
نویسنده
چکیده
This paper presents applications for the weak protection of secrets in which weakness is not just acceptable but desirable. For one application, two versions of a lottery scheme are presented in which the result of the lottery is determined by the ticket numbers purchased, but no one can control the outcome or determine what it is until after the lottery closes. This is because the outcome is kept secret in a way that is breakable after a predictable amount of time and/or computation. Another presented application is a variant on fair exchange protocols that requires no trusted third party at
منابع مشابه
Fair Exchange of Short Signatures without Trusted Third Party
We propose a protocol to exchange Boneh-Boyen short signatures in a fair way, without relying on a trusted third party. Our protocol is quite practical and is the first of the sort to the best of our knowledge. Our construction uses a new non-interactive zero-knowledge (NIZK) argument to prove that a commitment is the encryption of a bit vector. We also design a NIZK argument to prove that a co...
متن کاملQuantum bit commitment in a noisy channel
Under rather general assumptions about the properties of a noisy quantum channel, a first quantum protocol is proposed which allows to implement the secret bit commitment with the probability arbitrarily close to unity. The idea that quantum physics can provide more secure communication between two distant parties than the classical one was first put forward by Wiesner [1]. Later, after the wor...
متن کاملSecret Information Steganography Using LSB Insertion Methodwithout Bit Layout Section with Increasing Substitution Rate and High Reliability
In this paper, a faster method for embedding cryptographic information in the image ispresented by expressing the concept of latent prints (Steganography). Data is encrypted bytwo methods before embedding to increase reliability. Then they are embedded into the imageby a button, a method has been expressed to reduce potential noise impact on the wayinformation is encoded.
متن کاملVerifiable Disclosure of Secrets and Applications (Abstract)
A ? 2 1 {Oblivious Bit Transfer protocol is a way for a party Rachel to get one bit from a pair b 0 ; b 1 that another party Sam ooers her. The diiculty is that Sam should not nd out which secret Rachel is getting while Rachel should not be able to get partial information about more than one of the bits. This paper shows a way to make "veriiable" this protocol (v-? 2 1 {Oblivious Bit Transfer) ...
متن کاملLecture 24 : Zero Knowledge
Last lecture, we discussed cryptographic protocols. In particular, we gave a quantum protocol for secret key exchange that is secure in an information theoretical sense provided there is a secure public classical channel. We also discussed bit commitment and showed that no quantum protocol has information theoretic security. Today we will discuss zero knowledge systems and give an example of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1998